Effective Wireless Scheduling via Hypergraph Sketches
نویسندگان
چکیده
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 16 July 2019Accepted: 25 January 2021Published online: 13 April 2021Keywordswireless network, SINR model, scheduling, conflict graphAMS Subject Headings68Q25, 68R10, 68M10Publication DataISSN (print): 0097-5397ISSN (online): 1095-7111Publisher: Society for Industrial and Applied MathematicsCODEN: smjcat
منابع مشابه
On Constrained Hypergraph Coloring and Scheduling
We consider the design of approximation algorithms for multicolor generalization of the well known hypergraph 2-coloring problem (property B). Consider a hypergraph H with n vertices, s edges, maximum edge degree D(≤ s) and maximum vertex degree d(≤ s). We study the problem of coloring the vertices of H with minimum number of colors such that no hyperedge i contains more than bi vertices of any...
متن کاملEffective Scheduling for Coded Distributed Storage in Wireless Sensor Networks
A distributed storage approach is proposed to access data reliably and to cope with node failures in wireless sensor networks. This approach is based on random linear network coding in combination with a scheduling algorithm based on backpressure. Upper bounds are provided on the maximum rate at which data can be reliably stored. Moreover, it is shown that the backpressure algorithm allows to o...
متن کاملCoreference resolution via hypergraph partitioning
Coreference resolution is one of the most fundamental Natural Language Processing tasks, aiming to identify the coreference relation in texts. The task is to group mentions (i.e. phrases of interest) into sets, so that all mentions in one set refer to the same entity (i.e. a real world object). Mentions are conventionally proper names, common nouns and pronouns. Lately, the coreference task has...
متن کاملAn Effective Algorithm for Multiway Hypergraph Partitioning
In this paper, we propose an effective multiway hypergraph partitioning algorithm. We introduce the concept of net gain and embed it in the selection of cell moves. Unlike traditional FM-based iterative improvement algorithms in which the selection of the next cell to move is only based on its cell gain, our algorithm selects a cell based on both its cell gain and the sum of all net gains for t...
متن کاملClustering Hand-Drawn Sketches via Analogical Generalization
One of the major challenges to building intelligent educational software is determining what kinds of feedback to give learners. Useful feedback makes use of models of domain-specific knowledge, especially models that are commonly held by potential students. To empirically determine what these models are, student data can be clustered to reveal common misconceptions or common problem-solving st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2021
ISSN: ['1095-7111', '0097-5397']
DOI: https://doi.org/10.1137/19m1275085